Reasoning with Preorders and Dynamic Sorts Using Free Variable Tableaux
نویسندگان
چکیده
In this paper we present a three valued many sorted logic for dealing with preorders, incorporating subsort relations into the syntax of the language, and where formulas taking the third boolean value as interpretation contain a term or a predicate not well-sorted w.r.t. the signature. For this logic a ground tableau-based deduction method and a free variable extension version are proposed, proving their soundness and completeness.
منابع مشابه
Semantic Tableaux for a Logic with Preorders and Dynamic Sorts
In this paper we present a logic for dealing with preorders, where functions and predicates behave monotonically or antimonotonically in their arguments, and incorporating order-sorted relations into the syntax of the language. For this logic a ground tableau-based deduction method and a free variable extension version are proposed, proving their soundness and completeness. Finally, an implemen...
متن کاملConstrained Hyper Tableaux
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper tableaux are a generalization of hyper tableaux, where branch closing substitutions, from the point of view of model generation, give rise to constraints on satisfying assignments for the branch. These variable constraints...
متن کاملIncremental Theory Reasoning Methods
Theory reasoning is an important technique for increasing the eeciency of automated deduction systems. In this paper we present incremental theory reasoning, a method that improves the interaction between the foreground reasoner and the background (theory) reasoner and, thus, the eeciency of the combined system. The use of incremental theory reasoning in free variable semantic tableaux and the ...
متن کاملIncremental Theory Reasoning Methods forSemantic
Theory reasoning is an important technique for increasing the eeciency of automated deduction systems. In this paper we present incremental theory reasoning, a method that improves the interaction between the foreground reasoner and the background (theory) reasoner and, thus, the eeciency of the combined system. The use of incremental theory reasoning in free variable semantic tableaux and the ...
متن کاملCEDAR: a Fast Taxonomic Reasoner Based on Lattice Operations
Taxonomy classification and query answering are the core reasoning services provided by most of the Semantic Web (SW) reasoners. However, the algorithms used by those reasoners are based on Tableau method or Rules. These well-known methods in the literature have already shown their limitations for large-scale reasoning. In this demonstration, we shall present the CEDAR system for classifying an...
متن کامل